Utility Accrual Scheduling of Distributable Threads: The Tempus Approach
نویسندگان
چکیده
Dynamic, adaptive, real-time embedded control systems are present at any level(s) of an enterprise— e.g., devices in the defense domain such as multi-mode phased array radars and battle management. These embedded systems often include“soft”as well as“hard” time constraints. Jensen’s time/utility functions [4] (or TUFs) allow the semantics of soft time constraints to be precisely specified. A TUF specifies the utility to the system, resulting from the completion of an activity, as a function of the its completion time. Figure 1 shows examples of TUF time constraints. TUFs have been successfully used in two significant, real-time applications, including an AWACS (Airborne WArning and Control System) surveillance mode tracker system built by MITRE and Open Group, and a coastal air defense system built by CMU and General Dynamics. When timing constraints are expressed with TUFs, the scheduling optimality criteria are based on factors in terms of maximizing accrued utility from those activities—e.g., maximizing the sum, or the expected sum, of the activities’ attained utilities. Such criteria are called Utility Accrual (or UA) criteria, and sequencing (scheduling, dispatching) algorithms that consider UA criteria are called UA sequencing algorithms. Motivated by the need for dynamic scheduling, e.g., UA scheduling, in real-time distributed systems, the Object Management Group recently adopted the Real-Time CORBA 2.0 (Dynamic Scheduling) standard [7] (abbreviated here as RTC2). RTC2 specifies distributable threads (or DT s) as a programming and scheduling abstraction for system-wide, end-to-end scheduling in real-time distributed systems. The distributable thread model is a subset of the distributed thread model that was created in Jensen’s Archons Project [3]. A DT is a single thread of execution with a globally unique identifier that transparently extends and retracts through an arbitrary number of local and remote objects. Concurrency is at the DT-level.
منابع مشابه
Scheduling Distributable Real-Time Threads in Middleware
We present the Tempus real-time middleware. Tempus supports Real-Time CORBA 2.0’s distributable threads (DTs) as an end-to-end programming abstraction for distributed real-time systems. DTs in Tempus can have time constraints, including time/utility functions (TUFs), can have resource constraints, particularly mutual exclusion, and can be scheduled according to utility accrual (UA) disciplines....
متن کاملTime/Utility Function Decomposition in Soft Real-Time Distributed Systems
We consider RealTime CORBA 2.0 (Dynamic Scheduling) distributable threads, whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources—both physical (processor, disk, I/O, etc.) and logical (locks, etc.)—are shared among timecritical distributable threads and local applications that may or may not be...
متن کاملConsensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate a consensus utility accrual scheduling algorithm for distributable threads with run-time uncertainties in execution time, arrival models, and node crash failures. The DUA-CLA algorithm’s message complexity (O(fn)), lower time complexity bound (O(D+fd+nk)), and failure-free execution time (O(D+ nk)) are established, where D is the worst-case communication delay, d is the failure d...
متن کاملScheduling Dependent Distributable Real-Time Threads in Dynamic Networked Embedded Systems
We consider scheduling distributable real-time threads with dependencies (e.g, due to synchronization) in partially synchronous systems in the presence of node failure. We present a distributed real-time scheduling algorithm called DQBUA. The algorithm uses quorum systems to coordinate nodes’ activities when constructing a global schedule. DBQUA detects and resolves distributed deadlock in a ti...
متن کاملProbabilistic, Real-Time Scheduling of Distributable Threads Under Dependencies in Ad Hoc Networks
We consider scheduling distributable threads that are subject to dependencies (e.g., due to mutual exclusion constraints) in ad hoc networks, in the presence of node and link failures, message losses, and dynamic node joins and departures. We present a gossip-based distributed scheduling algorithm, called Real-Time Gossip algorithm for Dependencies (or RTG-D). RTG-D builds upon our prior algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004